`:top
`!Evolutionary programming`! is an `F33f`_`[evolutionary algorithm`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Evolutionary_algorithm]`_`f, where a share of new population is created by mutation of previous population without `F33f`_`[crossover`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Crossover_(evolutionary_algorithm)]`_`f.`:cite-ref-overview-1-0[`F5bf`_`[1`#cite-note-overview-1]`_`f]`:cite-ref-2[`F5bf`_`[2`#cite-note-2]`_`f] Evolutionary programming differs from `F33f`_`[evolution strategy`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Evolution_strategy]`_`f ES( μ μ + λ λ {\\displaystyle \\mu +\\lambda } ) in one detail.`:cite-ref-overview-1-1[`F5bf`_`[1`#cite-note-overview-1]`_`f] All individuals are selected for the new population, while in ES( μ μ + λ λ {\\displaystyle \\mu +\\lambda } ), every individual has the same probability to be selected. It is one of the four major evolutionary algorithm `F33f`_`[paradigms`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Programming_paradigms]`_`f.`:cite-ref-3[`F5bf`_`[3`#cite-note-3]`_`f]
>>Contents
• `F0af`_`[History`#history]`_`f
• `F0af`_`[See also`#see-also]`_`f
• `F0af`_`[References`#references]`_`f
• `F0af`_`[External links`#external-links]`_`f
-─
>>History
It was first used by `F33f`_`[Lawrence J. Fogel`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Lawrence_J._Fogel]`_`f in the US in 1960 in order to use simulated `F33f`_`[evolution`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Evolution]`_`f as a learning process aiming to generate `F33f`_`[artificial intelligence`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Artificial_intelligence]`_`f.`:cite-ref-4[`F5bf`_`[4`#cite-note-4]`_`f] It was used to evolve `F33f`_`[finite-state machines`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Finite-state_machine]`_`f as predictors.`:cite-ref-5[`F5bf`_`[5`#cite-note-5]`_`f]
`t
| Year | Description | Reference |
|---|---|---|
| 1966 | EP introduced by Fogel et al. | [ 6 ] |
| 1992 | Improved fast EP - Cauchy mutation is used instead of Gaussian mutation | [ 7 ] |
| 2002 | Generalized EP - usage of Lévy -type mutation | [ 8 ] |
| 2012 | Diversity-guided EP - Mutation step size is guided by diversity | [ 9 ] |
| 2013 | Adaptive EP - The number of successful mutations determines the strategy parameter | [ 10 ] |
| 2014 | Social EP - Social cognitive model is applied meaning replacing individuals with cognitive agents | [ 11 ] |
| 2015 | Immunised EP - Artificial immune system inspired mutation and selection | [ 12 ] |
| 2016 | Mixed mutation strategy EP - Gaussian, Cauchy and Lévy mutations are used | [ 13 ] |
| 2017 | Fast Convergence EP - An algorithm, which boosts convergence speed and solution quality | [ 14 ] |
| 2017 | Immune log-normal EP - log-normal mutation combined with artificial immune system | [ 15 ] |
| 2018 | ADM-EP - automatically designed mutation operators | [ 16 ] |
`t
>>See also
• `F33f`_`[Artificial intelligence`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Artificial_intelligence]`_`f
• `F33f`_`[Genetic algorithm`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Genetic_algorithm]`_`f
• `F33f`_`[Genetic operator`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Genetic_operator]`_`f
>>References
`:cite-note-overview-1`!1.`! `F0af`_`[↑`#cite-ref-overview-1-0]`_`f `:citerefslowikkwasnicka2020`aSlowik, Adam; Kwasnicka, Halina (1 August 2020). "Evolutionary algorithms and their applications to engineering problems". `*Neural Computing and Applications`*. `!32`! (16): 12363–12379. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1007/s00521-020-04832-8. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1433-3058.
`:cite-note-2`!2.`! `F0af`_`[↑`#cite-ref-2]`_`f `:citerefabidoelazouni2021`aAbido, Mohammad A.; Elazouni, Ashraf (30 November 2021). "Modified multi-objective evolutionary programming algorithm for solving project scheduling problems". `*Expert Systems with Applications`*. `!183`!: 115338. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1016/j.eswa.2021.115338. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 0957-4174.
`:cite-note-3`!3.`! `F0af`_`[↑`#cite-ref-3]`_`f `:citerefbrameier2004`aBrameier, Markus (2004). "On Linear Genetic Programming". `*Dissertation`*. Retrieved 27 December 2024.
`:cite-note-4`!4.`! `F0af`_`[↑`#cite-ref-4]`_`f "Artificial Intelligence through Simulated Evolution". `*Evolutionary Computation`*. 2009. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1109/9780470544600.ch7. `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-0-470-54460-0.
`:cite-note-5`!5.`! `F0af`_`[↑`#cite-ref-5]`_`f `:citerefabrahamnedjahmourelle2006`aAbraham, Ajith; Nedjah, Nadia; Mourelle, Luiza de Macedo (2006). "Evolutionary Computation: from Genetic Algorithms to Genetic Programming". `*Genetic Systems Programming: Theory and Experiences`*. Studies in Computational Intelligence. `!13`!. Springer: 1–20. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1007/3-540-32498-4_1. `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-3-540-29849-6.
`:cite-note-6`!1.`! `:citereffogelowenswalsh1966`aFogel, LJ; Owens, AJ; Walsh, MJ (1966). `*rtificial intelligence thorough simulated evolution`*. New York: Wiley.
`:cite-note-7`!2.`! `:citerefxin-yaoyong-liuguangming-lin1999`aXin Yao; Yong Liu; Guangming Lin (July 1999). "Evolutionary programming made faster". `*IEEE Transactions on Evolutionary Computation`*. `!3`! (2): 82–102. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1109/4235.771163.
`:cite-note-8`!3.`! `:citerefiwamatsu2002`aIwamatsu, Masao (1 August 2002). "Generalized evolutionary programming with Lévy-type mutation". `*Computer Physics Communications`*. `!147`! (1): 729–732. `F33f`_`[Bibcode`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Bibcode_(identifier)]`_`f:2002CoPhC.147..729I. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1016/S0010-4655(02)00386-7. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 0010-4655.
`:cite-note-9`!4.`! `:citerefalamislamyaomurase2012`aAlam, Mohammad Shafiul; Islam, Md. Monirul; Yao, Xin; Murase, Kazuyuki (1 June 2012). "Diversity Guided Evolutionary Programming: A novel approach for continuous optimization". `*Applied Soft Computing`*. `!12`! (6): 1693–1707. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1016/j.asoc.2012.02.002. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1568-4946.
`:cite-note-10`!5.`! `:citerefdasmallipeddimaity2013`aDas, Swagatam; Mallipeddi, Rammohan; Maity, Dipankar (1 April 2013). "Adaptive evolutionary programming with p-best mutation strategy". `*Swarm and Evolutionary Computation`*. `!9`!: 58–68. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1016/j.swevo.2012.11.002. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 2210-6502.
`:cite-note-11`!6.`! `:citerefnanxiaominshouzhenjinghong2014`aNan, LI; Xiaomin, BAI; Shouzhen, ZHU; Jinghong, ZHENG (1 January 2014). "Social Evolutionary Programming Algorithm onUnit Commitment in Wind Power Integrated System". `*IFAC Proceedings Volumes`*. `!47`! (3): 3611–3616. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.3182/20140824-6-ZA-1003.00384. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1474-6670.
`:cite-note-12`!7.`! `:citerefgao2015`aGao, Wei (1 August 2015). "Slope stability analysis based on immunised evolutionary programming". `*Environmental Earth Sciences`*. `!74`! (4): 3357–3369. `F33f`_`[Bibcode`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Bibcode_(identifier)]`_`f:2015EES....74.3357G. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1007/s12665-015-4372-0. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1866-6299.
`:cite-note-13`!8.`! `:citerefpangdonghefeng2016`aPang, Jinwei; Dong, Hongbin; He, Jun; Feng, Qi (July 2016). "Mixed mutation strategy evolutionary programming based on Shapley value". `*2016 IEEE Congress on Evolutionary Computation (CEC)`*. pp. 2805–2812. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1109/CEC.2016.7744143. `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-1-5090-0623-6.
`:cite-note-14`!9.`! `:citerefbasu2017`aBasu, Mousumi (14 September 2017). "Fast Convergence Evolutionary Programming for Multi-area Economic Dispatch". `*Electric Power Components and Systems`*. `!45`! (15): 1629–1637. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1080/15325008.2017.1376234. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1532-5008.
`:cite-note-15`!10.`! `:citerefmansormusirinothman2017`aMansor, M.H.; Musirin, I.; Othman, M.M. (April 2017). "Immune Log-Normal Evolutionary Programming (ILNEP) for solving economic dispatch problem with prohibited operating zones". `*2017 4th International Conference on Industrial Engineering and Applications (ICIEA)`*. pp. 163–167. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1109/IEA.2017.7939199. `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-1-5090-6774-9.
`:cite-note-16`!11.`! `:citerefhongdrakewoodward-zcan2018`aHong, Libin; Drake, John H.; Woodward, John R.; Özcan, Ender (1 January 2018). "A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming". `*Applied Soft Computing`*. `!62`!: 162–175. `F33f`_`[doi`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doi_(identifier)]`_`f:10.1016/j.asoc.2017.10.002. `F33f`_`[ISSN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISSN_(identifier)]`_`f 1568-4946.
>>External links
• The Hitch-Hiker's Guide to Evolutionary Computation: What's Evolutionary Programming (EP)?
• Evolutionary Programming by Jason Brownlee (PhD) Archived 2013-01-18 at the `F33f`_`[Wayback Machine`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Wayback_Machine]`_`f
`c`F0af`_`[↑ Back to top`#top]`_`f`a